Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems
نویسنده
چکیده
We show that a number of Npo PB-complete problems, including Min Ones and Max Ones, are hard to approximate within n 1? for arbitrary > 0.
منابع مشابه
Tight Lower Bounds on the Approximability of Some NPO PB Complete Problems
We investigate the approximability of the NPO PB complete problems Min Ones Min Dones Max Ones Max Dones and Max PB Programming We show that unless P NP these problems are not approximable within n for any where n is the number of variables in the input Since all of these problems are approximable within n this lower bound is close to optimal
متن کاملOn the Approximability of the Maximum Common Subgraph Problem
Some versions of the maximum common subgraph problem are studied and approximation algorithms are given. The maximum bounded common induced subgraph problem is shown to be Max SNP-hard and the maximum unbounded common induced subgraph problem is shown to be as hard to approximate as the maximum independent set problem. The maximum common induced connected subgraph problem is still harder to app...
متن کاملStrong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems
The approximability of several NP maximization problems is investigated and strong lower bounds for the studied problems are proved. For some of the problems the bounds are the best that can be achieved, unless P = NP. For example we investigate the approximability of Max PB 0 ? 1 Programming, the problem of nding a binary vector x that satisses a set of linear relations such that the objective...
متن کاملLinkk Oping Electronic Articles in Tight Lower Bounds on the Approximability of Some Npo Pb-complete Problems Linkk Oping Electronic Articles in Computer and Information Science
The publishers will keep this article on-line on the Internet (or its possible replacement network in the future) for a period of 25 years from the date of publication, barring exceptional circumstances as described separately. The on-line availability of the article implies a permanent permission for anyone to read the article on-line, to print out single copies of it, and to use it unchanged ...
متن کاملAn Approximability-related Parameter on Graphs - Properties and Applications
We introduce a binary parameter on optimisation problems called separation. The parameter is used to relate the approximation ratios of different optimisation problems; in other words, we can convert approximability (and nonapproximability) result for one problem into (non)-approximability results for other problems. Our main application is the problem (weighted) maximum H-colourable subgraph (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 68 شماره
صفحات -
تاریخ انتشار 1998